Spectrum of Andreev Bound States in a Molecule Embedded Inside a Microwave-Excited Superconducting Junction

Non-dissipative Josephson current through nanoscale superconducting constrictions is carried by spectroscopically sharp energy states, so-called Andreev bound states. Although theoretically predicted almost 40 years ago, no direct spectroscopic evidence of these Andreev bound states exists to date. We propose a novel type of spectroscopy based on embedding a superconducting constriction, formed by a single-level molecule junction, in a microwave QED cavity environment. In the electron-dressed cavity spectrum we find a polariton excitation at twice the Andreev bound state energy, and a superconducting-phase dependent ac Stark shift of the cavity frequency. Dispersive measurement of this frequency shift can be used for Andreev bound state spectroscopy.Comment: Published version; 4+ pages, 3 figure

Phase Modulated Thermal Conductance of Josephson Weak Links

We present a theory for quasiparticle heat transport through superconducting weak links. The thermal conductance depends on the phase difference ($\phi$) of the superconducting leads. Branch conversion processes, low-energy Andreev bound states near the contact and the suppression of the local density of states near the gap edge are related to phase-sensitive transport processes. Theoretical results for the influence of junction transparency, temperature and disorder, on the phase modulation of the conductance are reported. For high-transmission weak links, $D\to 1$, the formation of an Andreev bound state at $\epsilon_{\text{\tiny b}}=\Delta\cos(\phi/2)$ leads to suppression of the density of states for the continuum excitations that transport heat, and thus, to a reduction in the conductance for $\phi\simeq\pi$. For low-transmission ($D\ll 1$) barriers resonant scattering at energies $\epsilon\simeq(1+D/2)\Delta$ leads to an increase in the thermal conductance as $T$ drops below $T_c$ (for phase differences near $\phi=\pi$).Comment: 4 pages, 3 figures Expanded discussion of boundary conditions for Ricatti amplitude

A Survey of Practical Formal Methods for Security

In today's world, critical infrastructure is often controlled by computing systems. This introduces new risks for cyber attacks, which can compromise the security and disrupt the functionality of these systems. It is therefore necessary to build such systems with strong guarantees of resiliency against cyber attacks. One way to achieve this level of assurance is using formal verification, which provides proofs of system compliance with desired cyber security properties. The use of Formal Methods (FM) in aspects of cyber security and safety-critical systems are reviewed in this article. We split FM into the three main classes: theorem proving, model checking, and lightweight FM. To allow the different uses of FM to be compared, we define a common set of terms. We further develop categories based on the type of computing system FM are applied in. Solutions in each class and category are presented, discussed, compared, and summarised. We describe historical highlights and developments and present a state-of-the-art review in the area of FM in cyber security. This review is presented from the point of view of FM practitioners and researchers, commenting on the trends in each of the classes and categories. This is achieved by considering all types of FM, several types of security and safety-critical systems, and by structuring the taxonomy accordingly. The article hence provides a comprehensive overview of FM and techniques available to system designers of security-critical systems, simplifying the process of choosing the right tool for the task. The article concludes by summarising the discussion of the review, focusing on best practices, challenges, general future trends, and directions of research within this field

State of the Art Report : Verified Computation

This report describes the state of the art in verifiable computation. The problem being solved is the following: The Verifiable Computation Problem (Verifiable Computing Problem) Suppose we have two computing agents. The first agent is the verifier, and the second agent is the prover. The verifier wants the prover to perform a computation. The verifier sends a description of the computation to the prover. Once the prover has completed the task, the prover returns the output to the verifier. The output will contain proof. The verifier can use this proof to check if the prover computed the output correctly. The check is not required to verify the algorithm used in the computation. Instead, it is a check that the prover computed the output using the computation specified by the verifier. The effort required for the check should be much less than that required to perform the computation. This state-of-the-art report surveys 128 papers from the literature comprising more than 4,000 pages. Other papers and books were surveyed but were omitted. The papers surveyed were overwhelmingly mathematical. We have summarised the major concepts that form the foundations for verifiable computation. The report contains two main sections. The first, larger section covers the theoretical foundations for probabilistically checkable and zero-knowledge proofs. The second section contains a description of the current practice in verifiable computation. Two further reports will cover (i) military applications of verifiable computation and (ii) a collection of technical demonstrators. The first of these is intended to be read by those who want to know what applications are enabled by the current state of the art in verifiable computation. The second is for those who want to see practical tools and conduct experiments themselves

Esophageal positions relative to the left atrium; data from 293 patients before catheter ablation of atrial fibrillation

Aims: Three-dimensional rotational angiography (3DRA) of the left atrium (LA) and the esophagus is a simple and safe method for analyzing the relationship between the esophagus and the LA during catheter ablation of atrial fibrillation. The purpose of this study is to describe the location of the esophagus relative to the LA and mobility of the esophagus during ablation procedure. Methods: From 3/2011 to 9/2015, 3DRA of the LA and esophagus was performed in 326 patients before catheter ablation of atrial fibrillation. 3DRAwas performed with visualization of the esophagus via peroral administration of a contrast agent. The positions of the esophagus were determined at the beginning of the procedure, for part of patients also at the end of procedure with contrast esophagography. Results: The most frequent position is behind the center of the LA (91 pts., 31.9%) The least frequent position is behind the right pulmonary veins (27 pts., 9.4%). The average shift of the esophagus position was 3.36 ± 2.15 mm, 3.59 ± 2.37 mm and 3.67 ± 3.23 mm for superior, middle and inferior segment resp. Conclusions: The position of the esophagus to the LA is highly variable. The most common position of the esophagus relative to the LA is behind the middle and left part of the posterior wall of the LA. The least frequently observed position is behind the right pulmonary veins. No significant position change of esophagus motion from before to after the ablation procedure in the majority (≥95%) of the patients was observed

Reduced Radiation Exposure Protocol during Computer Tomography of the Left Atrium Prior to Catheter Ablation in Patients with Atrial Fibrillation

(1) Background: Computer tomography (CT) is an imaging modality used in the pre-planning of radiofrequency catheter ablation (RFA) procedure in patients with cardiac arrhythmias. However, it is associated with a considerable ionizing radiation dose for patients. This study aims to develop and validate low-dose CT scanning protocols of the left atrium (LA) for RFA guidance. (2) Methods: 68 patients scheduled for RFA of atrial fibrillation were sequentially assigned to four groups of ECG-gated scanning protocols, based on the set tube current (TC): Group A (n = 20, TC = 33 mAs), Group B (n = 18, TC = 67 mAs), Group C (n = 10, TC = 135 mAs), and control Group D (n = 20, TC = 600 mAs). We used a 256-row multidetector CT with body weight-dependent tube voltage of 80 kVp (<70 kg), 100 kVp (70–90 kg), and 120 kVp (>90 kg). We evaluated scanning parameters including radiation dose, total scanning procedure time and signal-to-noise ratio (SNR). (3) Results: The average effective radiation dose (ED) was lower in Group A in comparison to Group B, C and D (0.83 (0.76–1.10), 1.55 (1.36–1.67), 2.91 (2.32–2.96) and 9.35 (8.00–10.04) mSv, p < 0.05). The total amount of contrast media was not significantly different between groups. The mean SNR was 6.5 (5.8–7.3), 7.1 (5.7–8.2), 10.8 (10.1–11.3), and 12.2 (9.9–15.7) for Group A, B, C and D, respectively. The comparisons of SNR in group A vs. B and C vs. D were without significant differences. (4) Conclusions: Optimized pre-ablation CT scanning protocols of the LA can reduce an average ED by 88.7%. Three dimensional (3D) models created with the lowest radiation protocol are useful for the integration of electro-anatomic-guided RFA procedures